Speci cations with Observable
نویسندگان
چکیده
We consider algebraic speciications with observational features. Axioms as well as observations are formulae of full (Many-Sorted) First Order Logic with Equality. The associated semantics is based on a non standard interpretation of equality called observational equality. We study the adequacy of this semantics for software specii-cation and the relationship with behavioural equivalence of algebras. We show that this framework deenes an institution.
منابع مشابه
Formal speci cations and test : correctness and oraclePascale
This article presents a new formal approach to testing. In the eld of dynamic testing, as soon as a program fails for a test set, it is agged incorrect. The remaining question is: how far can a successful program be considered as correct? We give a de nition of program correctness with respect to a speci cation which is adequate to dynamic testing. Similarly to the eld of abstract implementatio...
متن کاملGeneralizing BIAS Speci cations
This paper generalizes the speci cation of Basic Interval Arithmetic Subroutines (BIAS) to support interval arithmetic on directed (i.e. proper and improper) intervals. This is due to our understanding that the arithmetic involving improper intervals will be increasingly used in future applications and the corresponding interval arithmetic implementations require no additional cost. We extend B...
متن کاملSpeci cations with Observable Formulae and ObservationalSatisfaction RelationTeodor
We consider algebraic speciications with observational features. Axioms as well as observations are formulae of full (Many-Sorted) First Order Logic with Equality. The associated semantics is based on a non standard interpretation of equality called observational equality. We study the adequacy of this semantics for software speciication and the relationship with behavioural equivalence of alge...
متن کاملComplexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results
We study the complexity of various combinatorial problems when instances are speci ed using one of the following succinct speci cations: (1) the 1-dimensional nite periodic narrow speci cations (denoted 1-FPN-speci cations) of Ford et al. and Wanke [FF58, Wa93]; (2) the 1-dimensional nite periodic narrow speci cations with explicit boundary conditions (denoted 1-FPN(BC)-speci cations) of Gale [...
متن کاملSpeci cation and Re nement of Finite Data ow Networks a Relational Approach
We specify the black box behavior of data ow components by characterizing the relation between the input and the output histories We distinguish between three main classes of such speci cations namely time independent speci cations weakly time dependent speci cations and strongly time dependent speci cations Data ow components are semantically modeled by sets of timed stream processing function...
متن کامل